A hashing technique using separate binary tree
نویسندگان
چکیده
منابع مشابه
An Efficient Trie Hashing Method Using a Compact Binary Trie
In many applications, information retrieval is a very important research eld. In several key strategies, the binary trie is famous as a fast access method to be able to retrieve keys in order. However, if the binary trie structure is implemented, the greater the number of the registered keys, the larger storage is required, as a result, the binary trie can not be stored into the main memory. In...
متن کاملA Hybrid Chaining Model with AVL and Binary Search Tree to Enhance Search Speed in Hashing
The main idea behind any hash function is to find a one to one correspondence between a key value and an index in the hash table where the key value can be placed. In closed hashing, it is very difficult to handle the situation of table overflow in a satisfactory manner. Key values are haphazardly placed and generally majority of the keys are placed far away from their hash location. Thus, the ...
متن کاملOptimizing affinity-based binary hashing using auxiliary coordinates
In supervised binary hashing, one wants to learn a function that maps a highdimensional feature vector to a vector of binary codes, for application to fast image retrieval. This typically results in a difficult optimization problem, nonconvex and nonsmooth, because of the discrete variables involved. Much work has simply relaxed the problem during training, solving a continuous optimization, an...
متن کاملS : a flexible coding for tree hashing
We propose a flexible, fairly general, coding for tree hash modes. The coding does not define a tree hash mode, but instead specifies a way to format the message blocks and chaining values into inputs to the underlying function for any topology, including sequential hashing. The main benefit is to avoid input clashes between different tree growing strategies, even before the hashing modes are d...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science Journal
سال: 2006
ISSN: 1683-1470
DOI: 10.2481/dsj.5.143